A better differential approximation ratio for symmetric TSP
نویسندگان
چکیده
In this paper, we study the approximability properties of symmetric TSP under an approximation measure called the differential ratio. More precisely, we improve up to 3/4 − ε (for any ε > 0) the best differential ratio of 2/3 known so far, given in Hassin and Khuller, “z-Approximations”, J. of Algorithms, 41(2), 429-442, 2001.
منابع مشابه
A On Approximating Multi-Criteria TSP
We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP). First, we devise randomized approximation algorithms for multi-criteria maximum traveling salesman problems (Max-TSP). For multi-criteria Max-STSP, where the edge weights have to be symmetric, we devise an algorithm with an approximation ratio of 2/3 − ε. For multi-criteria Max-AT...
متن کاملMulti-Criteria Traveling Salesman Problems
In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead, the aim is to compute a so-called Pareto curve of solutions. Since Pareto curves cannot be computed efficiently in general, we have to be cont...
متن کاملA 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
The traveling salesman problem is one of the most famous and heavily researched problems in computer science. The version we deal with in this paper is the Symmetric Maximum Traveling Salesman Problem, which is defined as follows. For a given complete undirected graph G with nonnegative weights on its edges, we wish to find a tour of the graph of maximum weight. The tour of the graph is a simpl...
متن کاملDifferential approximation results for the traveling salesman and related problems
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP . We show that TSP is 2/3-differential approximable and can not be differential approximable greater than 649/650. Next, we demonstrate that, when dealing with edge-costs 1 and 2, the same algorithm idea improves this ratio to 3/4 and we obtain a differential non-approximation threshold equal to ...
متن کامل1 2 O ct 2 00 6 Approximation Algorithms for Multi - criteria Traveling Salesman Problems ∗
In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead, the aim is to compute a so-called Pareto curve of solutions. Since Pareto curves cannot be computed efficiently in general, we have to be cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 396 شماره
صفحات -
تاریخ انتشار 2008